skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Jiménez, Daniel"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, IEEE)
    Full Text Available 
  2. ; ; (, The Electronic Journal of Combinatorics)
    Two matroids $$M$$ and $$N$$ are said to be concordant if there is a strong map from $$N$$ to $$M$$. This also can be stated by saying that each circuit of $$N$$ is a union of circuits of $$M$$. In this paper, we consider a class of matroids called positroids, introduced by Postnikov, and utilize their combinatorics to determine concordance among some of them. More precisely, given a uniform positroid, we give a purely combinatorial characterization of a family of positroids that is concordant with it. We do this by means of their associated decorated permutations. As a byproduct of our work, we describe completely the collection of circuits of this particular subset of positroids. 
    more » « less
    Full Text Available 
  3. ; ; ; ; (, Proceedings of the 54th Annual IEEE/ACM International Symposium on Microarchitecture)
    null (Ed.)
    Full Text Available 
  4. ; ; ; ; ; ; ; ; (, International Symposium on Computer Architecture (ISCA))
    Full Text Available 
  5. ; ; ; ; ; ; (, 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA))
    null (Ed.)
    Full Text Available 
  6. ; ; ; (, Proceedings of the 2020 IEEE International Symposium on Workload Characterization)
    null (Ed.)
    Accepted Manuscript Full Text Available
  7. ; ; ; (, Proceedings of the 53rd ACM/IEEE International Symposium on Microarchitecture)
    null (Ed.)
    Accepted Manuscript Full Text Available
  8. ; ; (, ICS '20: Proceedings of the 34th ACM International Conference on Supercomputing)
    Full Text Available 
  9. ; ; ; ; ; (, Proceedings of the 53rd ACM/IEEE International Symposium on Microarchitecture)
    null (Ed.)
    Full Text Available 
  10. ; ; ; (, Proceedings of the 46th International Symposium on Computer Architecture)
    Full Text Available